ReP USP - Resultado da busca

Artigo de periodico
Two- and three-dimensional parametric packing (2007)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Computers & Operations Research. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Two- and three-dimensional parametric packing. Computers & Operations Research, v. 34, n. 9, p. 2589-2603, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2005.10.001. Acesso em: 26 set. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2007). Two- and three-dimensional parametric packing. Computers & Operations Research, 34( 9), 2589-2603. doi:10.1016/j.cor.2005.10.001
NLM
Miyazawa FK, Wakabayashi Y. Two- and three-dimensional parametric packing [Internet]. Computers & Operations Research. 2007 ; 34( 9): 2589-2603.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.cor.2005.10.001
Vancouver
Miyazawa FK, Wakabayashi Y. Two- and three-dimensional parametric packing [Internet]. Computers & Operations Research. 2007 ; 34( 9): 2589-2603.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.cor.2005.10.001
Artigo de periodico
Three-dimensional packings with rotations (2009)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Computers & Operations Research. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Three-dimensional packings with rotations. Computers & Operations Research, v. 36, n. 10, p. 2801-2815, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2008.12.015. Acesso em: 26 set. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2009). Three-dimensional packings with rotations. Computers & Operations Research, 36( 10), 2801-2815. doi:10.1016/j.cor.2008.12.015
NLM
Miyazawa FK, Wakabayashi Y. Three-dimensional packings with rotations [Internet]. Computers & Operations Research. 2009 ; 36( 10): 2801-2815.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.cor.2008.12.015
Vancouver
Miyazawa FK, Wakabayashi Y. Three-dimensional packings with rotations [Internet]. Computers & Operations Research. 2009 ; 36( 10): 2801-2815.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.cor.2008.12.015
Trabalho de evento
The UPS problem (2001)
Fernandes, Cristina Gomes ; Nierho, Till
Source: Proceedings. Conference titles: Annual Symposium on Theoretical Aspects of Computer Science - STACS. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e NIERHO, Till. The UPS problem. 2001, Anais.. Berlin: Springer, 2001. Disponível em: https://doi.org/10.1007/3-540-44693-1_21. Acesso em: 26 set. 2024.
APA
Fernandes, C. G., & Nierho, T. (2001). The UPS problem. In Proceedings. Berlin: Springer. doi:10.1007/3-540-44693-1_21
NLM
Fernandes CG, Nierho T. The UPS problem [Internet]. Proceedings. 2001 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/3-540-44693-1_21
Vancouver
Fernandes CG, Nierho T. The UPS problem [Internet]. Proceedings. 2001 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/3-540-44693-1_21
Artigo de periodico
Strict convex regularizations, proximal points and augmented Lagrangians (2000)
Humes Júnior, Carlos; Silva, Paulo J. S.
Source: RAIRO - Operations Research. Unidade: IME
Assunto: ANÁLISE NUMÉRICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HUMES JÚNIOR, Carlos e SILVA, Paulo J. S. Strict convex regularizations, proximal points and augmented Lagrangians. RAIRO - Operations Research, v. 34, n. 3, p. 283-303, 2000Tradução . . Disponível em: https://doi.org/10.1051/ro:2000102. Acesso em: 26 set. 2024.
APA
Humes Júnior, C., & Silva, P. J. S. (2000). Strict convex regularizations, proximal points and augmented Lagrangians. RAIRO - Operations Research, 34( 3), 283-303. doi:10.1051/ro:2000102
NLM
Humes Júnior C, Silva PJS. Strict convex regularizations, proximal points and augmented Lagrangians [Internet]. RAIRO - Operations Research. 2000 ; 34( 3): 283-303.[citado 2024 set. 26 ] Available from: https://doi.org/10.1051/ro:2000102
Vancouver
Humes Júnior C, Silva PJS. Strict convex regularizations, proximal points and augmented Lagrangians [Internet]. RAIRO - Operations Research. 2000 ; 34( 3): 283-303.[citado 2024 set. 26 ] Available from: https://doi.org/10.1051/ro:2000102
Parte de monografia/livro
Stochastic chains with memory in variable length (2008)
Galves, Antonio ; Löcherbach, Eva
Source: Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Unidade: IME
Assunto: CADEIAS DE MARKOV
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GALVES, Antonio e LÖCHERBACH, Eva. Stochastic chains with memory in variable length. Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Tradução . Tampere: Tampere International Center for Signal Processing, 2008. . . Acesso em: 26 set. 2024.
APA
Galves, A., & Löcherbach, E. (2008). Stochastic chains with memory in variable length. In Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Tampere: Tampere International Center for Signal Processing.
NLM
Galves A, Löcherbach E. Stochastic chains with memory in variable length. In: Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Tampere: Tampere International Center for Signal Processing; 2008. [citado 2024 set. 26 ]
Vancouver
Galves A, Löcherbach E. Stochastic chains with memory in variable length. In: Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday. Tampere: Tampere International Center for Signal Processing; 2008. [citado 2024 set. 26 ]
Artigo de periodico
Solution of bounded nonlinear systems of equations using homotopies with inexact restoration (2003)
Birgin, Ernesto Julian Goldberg ; Krejic, Natavsa; Martínez, José Mário
Source: International Journal of Computer Mathematics. Unidade: IME
Assunto: PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e KREJIC, Natavsa e MARTÍNEZ, José Mário. Solution of bounded nonlinear systems of equations using homotopies with inexact restoration. International Journal of Computer Mathematics, v. 80, n. 2, p. 211-222, 2003Tradução . . Disponível em: https://doi.org/10.1080/00207160304672. Acesso em: 26 set. 2024.
APA
Birgin, E. J. G., Krejic, N., & Martínez, J. M. (2003). Solution of bounded nonlinear systems of equations using homotopies with inexact restoration. International Journal of Computer Mathematics, 80( 2), 211-222. doi:10.1080/00207160304672
NLM
Birgin EJG, Krejic N, Martínez JM. Solution of bounded nonlinear systems of equations using homotopies with inexact restoration [Internet]. International Journal of Computer Mathematics. 2003 ; 80( 2): 211-222.[citado 2024 set. 26 ] Available from: https://doi.org/10.1080/00207160304672
Vancouver
Birgin EJG, Krejic N, Martínez JM. Solution of bounded nonlinear systems of equations using homotopies with inexact restoration [Internet]. International Journal of Computer Mathematics. 2003 ; 80( 2): 211-222.[citado 2024 set. 26 ] Available from: https://doi.org/10.1080/00207160304672
Trabalho de evento
Searching in Random partially ordered sets (2002)
Carmo, Renato José da Silva; Donadelli Junior, Jair; Kohayakawa, Yoshiharu ; Laber, Eduardo Sany
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CARMO, Renato José da Silva et al. Searching in Random partially ordered sets. 2002, Anais.. Berlin: Springer, 2002. Disponível em: https://doi.org/10.1007/3-540-45995-2_27. Acesso em: 26 set. 2024.
APA
Carmo, R. J. da S., Donadelli Junior, J., Kohayakawa, Y., & Laber, E. S. (2002). Searching in Random partially ordered sets. In Proceedings. Berlin: Springer. doi:10.1007/3-540-45995-2_27
NLM
Carmo RJ da S, Donadelli Junior J, Kohayakawa Y, Laber ES. Searching in Random partially ordered sets [Internet]. Proceedings. 2002 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/3-540-45995-2_27
Vancouver
Carmo RJ da S, Donadelli Junior J, Kohayakawa Y, Laber ES. Searching in Random partially ordered sets [Internet]. Proceedings. 2002 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/3-540-45995-2_27
Artigo de periodico
Rescaled proximal methods for linearly constrained convex problems (2007)
Silva, Paulo J. S. ; Humes Júnior, Carlos
Source: Rairo - Operations Research. Unidade: IME
Subjects: PROGRAMAÇÃO CONVEXA, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Paulo J. S. e HUMES JÚNIOR, Carlos. Rescaled proximal methods for linearly constrained convex problems. Rairo - Operations Research, v. 41, n. 4, p. 367-380, 2007Tradução . . Disponível em: https://doi.org/10.1051/ro:2007032. Acesso em: 26 set. 2024.
APA
Silva, P. J. S., & Humes Júnior, C. (2007). Rescaled proximal methods for linearly constrained convex problems. Rairo - Operations Research, 41( 4), 367-380. doi:10.1051/ro:2007032
NLM
Silva PJS, Humes Júnior C. Rescaled proximal methods for linearly constrained convex problems [Internet]. Rairo - Operations Research. 2007 ; 41( 4): 367-380.[citado 2024 set. 26 ] Available from: https://doi.org/10.1051/ro:2007032
Vancouver
Silva PJS, Humes Júnior C. Rescaled proximal methods for linearly constrained convex problems [Internet]. Rairo - Operations Research. 2007 ; 41( 4): 367-380.[citado 2024 set. 26 ] Available from: https://doi.org/10.1051/ro:2007032
Parte de monografia/livro
Pattern inference under many guises (2003)
Sagot, Marie France; Wakabayashi, Yoshiko
Source: Recent advances in algorithms and combinatorics. Unidade: IME
Assunto: ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SAGOT, Marie France e WAKABAYASHI, Yoshiko. Pattern inference under many guises. Recent advances in algorithms and combinatorics. Tradução . New York: Springer, 2003. . Disponível em: https://doi.org/10.1007/0-387-22444-0_8. Acesso em: 26 set. 2024.
APA
Sagot, M. F., & Wakabayashi, Y. (2003). Pattern inference under many guises. In Recent advances in algorithms and combinatorics. New York: Springer. doi:10.1007/0-387-22444-0_8
NLM
Sagot MF, Wakabayashi Y. Pattern inference under many guises [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 set. 26 ] Available from: https://doi.org/10.1007/0-387-22444-0_8
Vancouver
Sagot MF, Wakabayashi Y. Pattern inference under many guises [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 set. 26 ] Available from: https://doi.org/10.1007/0-387-22444-0_8
Artigo de periodico
Parametric on-line algorithms for packing rectangles and boxes (2003)
Miyazawa, Flávio Keidi; Wakabayashi, Yoshiko
Source: European Journal of Operational Research. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flávio Keidi e WAKABAYASHI, Yoshiko. Parametric on-line algorithms for packing rectangles and boxes. European Journal of Operational Research, v. 150, n. 2, p. 281-292, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0377-2217(02)00539-8. Acesso em: 26 set. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2003). Parametric on-line algorithms for packing rectangles and boxes. European Journal of Operational Research, 150( 2), 281-292. doi:10.1016/s0377-2217(02)00539-8
NLM
Miyazawa FK, Wakabayashi Y. Parametric on-line algorithms for packing rectangles and boxes [Internet]. European Journal of Operational Research. 2003 ; 150( 2): 281-292.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/s0377-2217(02)00539-8
Vancouver
Miyazawa FK, Wakabayashi Y. Parametric on-line algorithms for packing rectangles and boxes [Internet]. European Journal of Operational Research. 2003 ; 150( 2): 281-292.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/s0377-2217(02)00539-8
Trabalho de evento-anais periodico
Packing triangles in low degree graphs and indifference graphs (2008)
Manic, Gordana; Wakabayashi, Yoshiko
Source: Discrete Mathematics. Conference titles: European Conference on Combinatorics - EuroComb. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MANIC, Gordana e WAKABAYASHI, Yoshiko. Packing triangles in low degree graphs and indifference graphs. Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.disc.2007.07.100. Acesso em: 26 set. 2024. , 2008
APA
Manic, G., & Wakabayashi, Y. (2008). Packing triangles in low degree graphs and indifference graphs. Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.disc.2007.07.100
NLM
Manic G, Wakabayashi Y. Packing triangles in low degree graphs and indifference graphs [Internet]. Discrete Mathematics. 2008 ; 308( 8): 1455-1471.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.disc.2007.07.100
Vancouver
Manic G, Wakabayashi Y. Packing triangles in low degree graphs and indifference graphs [Internet]. Discrete Mathematics. 2008 ; 308( 8): 1455-1471.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.disc.2007.07.100
Trabalho de evento
Packing problems with orthogonal rotations (2004)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Packing problems with orthogonal rotations. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24698-5_40. Acesso em: 26 set. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2004). Packing problems with orthogonal rotations. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24698-5_40
NLM
Miyazawa FK, Wakabayashi Y. Packing problems with orthogonal rotations [Internet]. Proceedings. 2004 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_40
Vancouver
Miyazawa FK, Wakabayashi Y. Packing problems with orthogonal rotations [Internet]. Proceedings. 2004 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_40
Artigo de periodico
Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate (2003)
Birgin, Ernesto Julian Goldberg ; Chambouleyron, Ivan Emílio; Martínez, José Mário
Source: Journal of Computational and Applied Mathematics. Unidade: IME
Assunto: PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e CHAMBOULEYRON, Ivan Emílio e MARTÍNEZ, José Mário. Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate. Journal of Computational and Applied Mathematics, v. 152, n. 1/2, p. 35-50, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0377-0427(02)00695-7. Acesso em: 26 set. 2024.
APA
Birgin, E. J. G., Chambouleyron, I. E., & Martínez, J. M. (2003). Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate. Journal of Computational and Applied Mathematics, 152( 1/2), 35-50. doi:10.1016/s0377-0427(02)00695-7
NLM
Birgin EJG, Chambouleyron IE, Martínez JM. Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate [Internet]. Journal of Computational and Applied Mathematics. 2003 ; 152( 1/2): 35-50.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/s0377-0427(02)00695-7
Vancouver
Birgin EJG, Chambouleyron IE, Martínez JM. Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate [Internet]. Journal of Computational and Applied Mathematics. 2003 ; 152( 1/2): 35-50.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/s0377-0427(02)00695-7
Artigo de periodico
On pairs of foliations defined by vector fields in the plane (2000)
Sotomayor, Jorge ; Zhitomirskii, Michail
Source: Discrete and Continuous Dynamical Systems. Unidade: IME
Subjects: SISTEMAS DINÂMICOS, TEORIA ERGÓDICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SOTOMAYOR, Jorge e ZHITOMIRSKII, Michail. On pairs of foliations defined by vector fields in the plane. Discrete and Continuous Dynamical Systems, v. 6, n. 3, p. 741-749, 2000Tradução . . Disponível em: https://doi.org/10.3934/dcds.2000.6.741. Acesso em: 26 set. 2024.
APA
Sotomayor, J., & Zhitomirskii, M. (2000). On pairs of foliations defined by vector fields in the plane. Discrete and Continuous Dynamical Systems, 6( 3), 741-749. doi:10.3934/dcds.2000.6.741
NLM
Sotomayor J, Zhitomirskii M. On pairs of foliations defined by vector fields in the plane [Internet]. Discrete and Continuous Dynamical Systems. 2000 ; 6( 3): 741-749.[citado 2024 set. 26 ] Available from: https://doi.org/10.3934/dcds.2000.6.741
Vancouver
Sotomayor J, Zhitomirskii M. On pairs of foliations defined by vector fields in the plane [Internet]. Discrete and Continuous Dynamical Systems. 2000 ; 6( 3): 741-749.[citado 2024 set. 26 ] Available from: https://doi.org/10.3934/dcds.2000.6.741
Artigo de periodico
Note on a min-max conjecture of Woodall (2001)
Lee, Orlando; Wakabayashi, Yoshiko
Source: Journal of Graph Theory. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LEE, Orlando e WAKABAYASHI, Yoshiko. Note on a min-max conjecture of Woodall. Journal of Graph Theory, v. 38, n. 1, p. 36-41, 2001Tradução . . Disponível em: https://doi.org/10.1002/jgt.1022. Acesso em: 26 set. 2024.
APA
Lee, O., & Wakabayashi, Y. (2001). Note on a min-max conjecture of Woodall. Journal of Graph Theory, 38( 1), 36-41. doi:10.1002/jgt.1022
NLM
Lee O, Wakabayashi Y. Note on a min-max conjecture of Woodall [Internet]. Journal of Graph Theory. 2001 ; 38( 1): 36-41.[citado 2024 set. 26 ] Available from: https://doi.org/10.1002/jgt.1022
Vancouver
Lee O, Wakabayashi Y. Note on a min-max conjecture of Woodall [Internet]. Journal of Graph Theory. 2001 ; 38( 1): 36-41.[citado 2024 set. 26 ] Available from: https://doi.org/10.1002/jgt.1022
Trabalho de evento-anais periodico
Multidimensional cube packing (2001)
Kohayakawa, Yoshiharu ; Miyazawa, Flávio Keidi; Raghavan, Prabhakar; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Multidimensional cube packing. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/S1571-0653(04)00237-9. Acesso em: 26 set. 2024. , 2001
APA
Kohayakawa, Y., Miyazawa, F. K., Raghavan, P., & Wakabayashi, Y. (2001). Multidimensional cube packing. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S1571-0653(04)00237-9
NLM
Kohayakawa Y, Miyazawa FK, Raghavan P, Wakabayashi Y. Multidimensional cube packing [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 110-113.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/S1571-0653(04)00237-9
Vancouver
Kohayakawa Y, Miyazawa FK, Raghavan P, Wakabayashi Y. Multidimensional cube packing [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 110-113.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/S1571-0653(04)00237-9
Trabalho de evento
Multicuts in unweighted graphs with bounded degree and bounded tree-width (1998)
Calinescu, Gruia ; Fernandes, Cristina Gomes ; Reed, Bruce
Source: Proceedings. Conference titles: Integer Programming and Combinatorial Optimization - IPCO. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e REED, Bruce. Multicuts in unweighted graphs with bounded degree and bounded tree-width. 1998, Anais.. Berlin: Springer, 1998. Disponível em: https://doi.org/10.1007/3-540-69346-7_11. Acesso em: 26 set. 2024.
APA
Calinescu, G., Fernandes, C. G., & Reed, B. (1998). Multicuts in unweighted graphs with bounded degree and bounded tree-width. In Proceedings. Berlin: Springer. doi:10.1007/3-540-69346-7_11
NLM
Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/3-540-69346-7_11
Vancouver
Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/3-540-69346-7_11
Artigo de periodico
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width (2003)
Calinescu, Gruia; Fernandes, Cristina Gomes ; Reed, Bruce A.
Source: Journal of Algorithms. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e REED, Bruce A. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, v. 48, n. 2, p. 333-359, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0196-6774(03)00073-7. Acesso em: 26 set. 2024.
APA
Calinescu, G., Fernandes, C. G., & Reed, B. A. (2003). Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, 48( 2), 333-359. doi:10.1016/s0196-6774(03)00073-7
NLM
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7
Vancouver
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7
Trabalho de evento-anais periodico
Multicuts in unweighted digraphs with bounded degree and bounded tree-width (2001)
Calinescu, Gruia ; Fernandes, Cristina Gomes
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes. Multicuts in unweighted digraphs with bounded degree and bounded tree-width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/S1571-0653(04)00258-6. Acesso em: 26 set. 2024. , 2001
APA
Calinescu, G., & Fernandes, C. G. (2001). Multicuts in unweighted digraphs with bounded degree and bounded tree-width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S1571-0653(04)00258-6
NLM
Calinescu G, Fernandes CG. Multicuts in unweighted digraphs with bounded degree and bounded tree-width [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 194-197.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/S1571-0653(04)00258-6
Vancouver
Calinescu G, Fernandes CG. Multicuts in unweighted digraphs with bounded degree and bounded tree-width [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 194-197.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/S1571-0653(04)00258-6
Artigo de periodico
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (2009)
Fernandes, Cristina Gomes ; Lee, Orlando; Wakabayashi, Yoshiko
Source: Discrete Applied Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e LEE, Orlando e WAKABAYASHI, Yoshiko. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Applied Mathematics, n. 2, p. 272-279, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2007.10.032. Acesso em: 26 set. 2024.
APA
Fernandes, C. G., Lee, O., & Wakabayashi, Y. (2009). Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Applied Mathematics, ( 2), 272-279. doi:10.1016/j.dam.2007.10.032
NLM
Fernandes CG, Lee O, Wakabayashi Y. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width [Internet]. Discrete Applied Mathematics. 2009 ;( 2): 272-279.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.dam.2007.10.032
Vancouver
Fernandes CG, Lee O, Wakabayashi Y. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width [Internet]. Discrete Applied Mathematics. 2009 ;( 2): 272-279.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.dam.2007.10.032

USP Schools

ReP

Filtros

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Conference titles

Countries/Territories

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration